Periodic destages from inside and outside diameters of disks to improve read response time via traversal of a spatial ordering of tracks

ABSTRACT

A storage controller that includes a cache, receives a command from a host, wherein a set of criteria corresponding to read response times for executing the command have to be satisfied. A destage application that destages tracks based at least on recency of usage and spatial location of the tracks is executed, wherein a spatial ordering of the tracks is maintained in a data structure, and the destage application traverses the spatial ordering of the tracks. Tracks are destaged from at least inside or outside diameters of disks at periodic intervals, while traversing the spatial ordering of the tracks, wherein the set of criteria corresponding to the read response times for executing the command are satisfied.

BACKGROUND

1. Field

The disclosure relates to a method, system, and article of manufacturefor periodic destages from insides and outside diameters of disks toimprove read response times.

2. Background

A storage controller may control a plurality of storage devices that mayinclude hard disks, tapes, etc. A cache may also be maintained by thestorage controller, where the cache may comprise a high speed storagethat is accessible more quickly in comparison to certain other storagedevices, such as, hard disks, tapes, etc. However, the total amount ofstorage capacity of the cache may be relatively smaller in comparison tothe storage capacity of certain other storage devices, such as, harddisks, etc., that are controlled by the storage controller. The cachemay be comprised of one or more of random access memory (RAM),non-volatile storage device (NVS), read cache, write cache, etc., thatmay interoperate with each other in different ways. The NVS may becomprised of a battery backed-up random access memory and may allowwrite operations to be performed at a high speed. The storage controllermay manage Input/Output (I/O) requests from networked hosts to theplurality of storage devices.

Caching techniques implemented by the storage controller assist inhiding I/O latency. The cache may comprise a high speed memory orstorage device used to reduce the effective time required to read datafrom or write data to a lower speed memory or device. The cache memoryis used for rapid access to data staged from external storage to serviceread data access requests, and to provide buffering of modified data.Write requests are written to the cache and then written (i.e.,destaged) to the external storage devices.

NVS was introduced for allowing fast writes. Generally, in the absenceof NVS, data writes may have to be synchronously written (i.e.,destaged) directly to the storage device to ensure consistency,correctness, and persistence. Otherwise failure of the server may causedata stored in the cache to be lost. Generally the rate of host writesexceeds the speed of the storage devices, hence without NVS the rate ofdata transfer to storage devices may be slow. NVS enables fast writes tocache where the writes are mirrored to and stored safely in the NVSuntil the writes can be transferred to the external storage device. Thedata is destaged from cache later (and discarded from NVS) in anasynchronous fashion thus hiding the write latency of the storagedevice. The cache and NVS typically store updates intended for multiplestorage devices. To guarantee continued low latency for writes, the datain the NVS may have to be drained so as to ensure that there is alwayssome empty space for incoming writes; otherwise, follow-on writes maybecome effectively synchronous, which may adversely impact the responsetime for host writes. On the other hand, if the writes are drained tooaggressively, then the benefits of write caching may not be fullyexploited since the average amount of NVS cache utilized may be low.

Staging to the cache from secondary storage and destaging from the cacheto secondary storage may be performed via a variety of cache managementmechanisms. For example temporal mechanisms, such as least recently used(LRU) based mechanisms may destage tracks based on which tracks areleast recently used (LRU). Spatial ordering of tracks may be performedby certain cache management mechanisms, where reads and writes arestored in increasing or decreasing order of logical addresses in anordered list and the ordered list traversed for destages. Such spatialdestaging may favor destaging segments of data located closest togetheron the disks.

SUMMARY OF THE PREFERRED EMBODIMENTS

Provided are a method, a system, and a computer program product in whicha storage controller that includes a cache, receives a command from ahost, wherein a set of criteria corresponding to read response times forexecuting the command have to be satisfied. A destage application thatdestages tracks based at least on recency of usage and spatial locationof the tracks is executed, wherein a spatial ordering of the tracks ismaintained in a data structure, and the destage application traversesthe spatial ordering of the tracks. Tracks are destaged from at leastinside or outside diameters of disks at periodic intervals, whiletraversing the spatial ordering of the tracks, wherein the set ofcriteria corresponding to the read response times for executing thecommand are satisfied.

In further embodiments, by destaging tracks from the inside and outsidediameters of disks at the periodic intervals, read tracks that arerelatively distant from a current location of a head are serviced byoverriding the spatial ordering.

In still further embodiments, the set of criteria specifies that theaverage read response time is to be less than a first threshold, andthat a predetermined percentage of reads are to be performed in a timeless than a second threshold.

In additional embodiments, a timer is set to a predetermined timeinterval and a destage counter is set to zero. A track at a cursorposition is picked up for destage while traversing a sorted binary treeof tracks that comprises the data structure. In response to determiningthat the timer has expired, and in response to determining that thedestage counter is zero, the first track at the beginning of the sortedbinary tree is found and destaged instead of a track at the cursorposition, without changing the cursor position. The destage counter isincremented to one and the destage application continues to pick uptracks to perform destages from the cursor.

In still additional embodiments, in response to determining that thetimer has expired, and in response to determining that the destagecounter is not zero, the last track at the end of the sorted binary treeis found and destaged instead of a track at the cursor position, withoutchanging the cursor position. The destage counter to set to zero and thetimer is set to the predetermined time interval. The destage applicationcontinues to pick up tracks to perform destages from the cursorposition.

In certain embodiments, the periodic interval is a fixed predeterminedperiod of time, where the fixed predetermined period of time isdetermined by simulating a workload that corresponds to at least readrequests at the storage controller from a stringent read requirementsapplication.

BRIEF DESCRIPTION OF THE DRAWINGS

Referring now to the drawings in which like reference numbers representcorresponding parts throughout:

FIG. 1 illustrates a block diagram of a computing environment thatincludes a storage controller coupled to a plurality of hosts and aplurality of storage devices, in accordance with certain embodiments;

FIG. 2 illustrates a block diagram that shows exemplary requirements onread response times, in accordance with certain embodiments;

FIG. 3 illustrates a flowchart that shows first operations forperforming periodic destages from inside and outside diameters of diskswhile traversing a data structure that stores tracks in a sorted spatialorder, in accordance with certain embodiments;

FIG. 4 illustrates a flowchart that shows second operations forperforming periodic destages from inside and/or outside diameters ofdisks while traversing a data structure that stores tracks in a sortedspatial order, in accordance with certain embodiments; and

FIG. 5 illustrates a block diagram of a computational system that showscertain elements that may be included in the storage controller of FIG.1, in accordance with certain embodiments.

DETAILED DESCRIPTION

In the following description, reference is made to the accompanyingdrawings which form a part hereof and which illustrate severalembodiments. It is understood that other embodiments may be utilized andstructural and operational changes may be made.

Spatial Locality Based Destaging and Read Response Time Requirements

Intelligent cache writing (IWC) is a hybrid of two other cachemanagement mechanisms referred to as CLOCK and CSCAN. CLOCK is a leastrecently used (LRU) based mechanism which destages tracks based on whichtracks are LRU or least recently used. To emulate CLOCK properties, IWCmaintains a temporal bit per track. The temporal bit gets set when thehost writes a track. Temporal bit gets reset when a destage scan comesacross a track with the temporal bit set. If the destage scan findsstrides with no tracks having a temporal bit set, the destage scan canchoose that stride for destage. CSCAN demotes tracks based on spatiallocation. To emulate CSCAN properties, IWC maintains a sorted list oftracks using a balanced tree. Destage scans looking for tracks todestage may traverse the balanced tree in the order of track locationfrom lowest to highest.

Some applications, such as mission critical applications, real-timeapplications, or certain applications in the medical field may havestrict requirements on read response times. Such applications may bereferred to as stringent read requirements applications. For example, incertain applications, the average read response time has to be less than15 milliseconds, 99.99% of the reads have to be completed in less than600 milliseconds, 99.9% of reads have to be completed in less than 200milliseconds, and 99% of reads have to be completed in less than 60milliseconds. For example, out of every 10000 reads, each of at least9900 reads have to be completed in less than 60 milliseconds, each of atleast 9990 reads have to be completed in less than 200 milliseconds, andeach of at least 9999 reads have to be completed in less than 600milliseconds, where the average time of each read should be less than 15milliseconds. In other words, no more than one read out of 10000 readscan take 600 milliseconds or more time, no more than 10 reads out of10000 can take 200 milliseconds or more time, and no more than 100 readsout of 10000 can take 60 milliseconds or more time.

In certain situations, by using IWC, destages are performed in a spatialorder, and read performance can suffer. When IWC is destaging in sortedorder of the data location, there may be reads on the devices that arespread all over the devices. Disk drives can ignore the reads in orderto avoid a long seek for servicing reads that are far from the head.There may be a CAL (command aging limit) timer with an exemplary defaultvalue of 500 milliseconds. When the CAL timer expires, the disk drivesare forced to service the read requests outstanding for a durationgreater than the default value of the CAL timer. Stringent readrequirements application may find that read service times of 500milliseconds to be too high for them.

In certain embodiments, an augmented IWC cache management mechanism isapplied. In the augmented IWC cache management mechanism, destages areperformed by traversing a sorted spatially ordered list of tracks.However, while performing destages from the sorted spatially orderedlist of tracks, every so often the augmented IWC cache managementmechanism performs one destage at ID (inside diameter) and/or onedestage at OD (outside diameter) of disk drives. This forces the diskdrives to service commands that are far apart from the current locationof the head. As a result reads that are far apart from the destagelocation can be serviced so as to satisfy the read requirements of thestringent read requirements application.

Exemplary Embodiments

FIG. 1 illustrates a block diagram of a computing environment 100 thatincludes a storage controller 102 coupled to a plurality of hosts 104 a,104 b, . . . 104 n, and a plurality of storage devices 106, inaccordance with certain embodiments. The plurality of storage devices106 may be referred to as secondary storage devices, in contrast to acache 108 that is included in the storage controller 102.

The storage controller 102 and the hosts 104 a . . . 104 n may compriseany suitable computational device including those presently known in theart, such as, a personal computer, a workstation, a server, a mainframe,a hand held computer, a palm top computer, a telephony device, a networkappliance, a blade computer, a server, etc. The storage controller 102,the hosts 104 a . . . 104 n, and the plurality of storage devices 106may communicate over a network, such as the Internet, a storage areanetwork, a wide area network, a local area network, etc.

The plurality of storage devices 106 may comprise any suitable storagedevices, such as physical hard disks, solid stage disks, etc., known inthe art. The storage devices 106 may be configured into volumes. Incertain embodiments, storage devices 106 may be disks that areconfigured as Redundant Array of Independent Disk (RAID) ranks. In FIG.1, a plurality of RAID ranks 110 a . . . 110 m are shown.

The cache 108 may comprise one or more of different types of memory,such as RAMs, write caches, read caches, NVS, etc. The different typesof memory that comprise the cache may interoperate with each other.Writes from the hosts 104 a . . . 104 n may initially be written to thecache 108 and then later destaged to the storage devices 106. Readrequests from the hosts 104 a . . . 104 n may be satisfied from thecache 108 if the corresponding information is available in the cache108, otherwise the information is staged from the storage devices 106 tothe cache 108 and then provided to the hosts 104 a . . . 104 n.

The storage controller 102 executes a destage application 114 that isalso referred to as an augmented intelligent write caching application.The augmented intelligent write caching application 114 maintains asorted binary tree of tracks 116 that are arranged in a spatial order ofoccurrence of the tracks on disks. The augmented intelligent writecaching application 114 also maintains a cursor 118 to the sorted binarytree 116, where the cursor 118 shows the position of the track to bedestaged while traversing the sorted binary tree 116.

The destage application 114 further maintains an inside diameter (ID)outside diameter (OD) timer 120 that is also referred to as a timer oran IDOD timer. The timer 120 may initially be set to a predeterminedduration of time, such as 10 milliseconds. The destage application 114also maintains a counter 122 referred to as a destage counter or an IDODdestage counter.

In certain embodiments, the augmented intelligent write cachingapplication 114 traverses the sorted binary tree 116 of tracks toperform destages such that a set of read requirements criteria 124 forcertain exemplary applications (e.g., stringent read requirementsapplication 126 shown in the exemplary host 104 a) are satisfied.

In certain embodiments, the stringent read requirements application 126with read response time requirements 124 may send a command from thehost 104 a to the storage controller 102. The command may comprise aread or a write request or some other command. The augmented intelligentwrite caching application 114 processes the command to at least satisfythe criteria indicated by the set of read requirements criteria 124, bytraversing the sorted binary tree 116 of tracks.

FIG. 2 illustrates a block diagram 200 that shows exemplary requirementson read response times 202 for exemplary stringent read requirementsapplications 126, in accordance with certain embodiments.

In certain embodiments the exemplary requirements of read response timesmay be as follows:

-   1) The average read response time is to be less than 15.0    milliseconds (shown via reference numeral 204);-   2) Four nines requirement: 99.99% of reads are to be completed in a    time that within 600 milliseconds (shown via reference numeral 206);-   3) Three nines requirement: 99.9% of reads are to be completed in a    time that is within 200 milliseconds (shown via reference numeral    208); and-   4) Two nines requirements: 99% of reads are to be completed in a    time that is within 60 milliseconds (shown via reference numeral    210).

In certain embodiments, if the wait time for a read is more than 500milliseconds, the read is performed even if there are any pendingwrites. The 500 milliseconds time is the command aging limit (CAL) time.In such embodiments, the four nines requirement may be easy to satisfy,but the three nines requirements and the two nines requirements may bedifficult to satisfy unless pending reads that are distant from thelocation of the head of a disk drive are provided some additionalpreference over pending destages (i.e., writes to disk from cache),while destaging tracks indicated in the sorted binary tree 116.

FIG. 3 illustrates a flowchart 300 that shows first operations forperforming periodic destages from inside and outside diameters of diskswhile traversing a data structure 116 that stores tracks in a sortedspatial order, in accordance with certain embodiments. The operationsshown in FIG. 3 may be performed by the augmented intelligent writecaching application 114 implemented in the storage controller 102.

Control starts at block 302 in which a timer 120 (e.g., the IDOD timer)is set to a predetermined time interval (e.g., 10 milliseconds), andthen control proceeds to block 304 in which a destage counter 122 (e.g.,the IDOD destage counter) is set to zero.

Control proceeds to block 306 in which the augmented intelligent writecaching application 114 starts traversing (i.e., scanning) the sortedbinary tree 116 of tracks. The augmented intelligent write cachingapplication 114 determines (at block 308) whether a track at a cursorposition has been picked up for destage while traversing the sortedbinary tree 116. If so, a determination is made (at block 310) as towhether the timer 120 has expired (i.e., the predetermined time intervalhas been exceeded). If the timer 120 has expired, then a determinationis made (at block 312) as to whether the destage counter 122 is zero.

If at block 312 a determination is made that the destage counter 122 iszero (“Yes” branch from block 312), the first track at the beginning ofthe sorted binary tree is found (at block 314) and destaged (at block316) instead of a track at the cursor position, without changing thecursor position. As a result the next set of destages will start fromthe cursor position once again. The destage counter 122 is incremented(at block 318) to one. Control returns to block 306 and the augmentedintelligent write caching application 114 continues to pick up tracks toperform destages from the cursor.

If at block 312 a determination is made that the destage counter 122 isnot zero (“No” branch from block 312) then the last track at the end ofthe sorted binary tree is found (at block 320) and destaged (at block322) instead of a track at the cursor position, without changing thecursor position. As a result the next set of destages will start fromthe cursor position once again. The destage counter 122 is set (at block324) to zero and the timer 120 is set (at block 326) to thepredetermined time interval. Control returns to block 306 and theaugmented intelligent write caching application 114 continues to pick uptracks to perform destages from the cursor. Control also returns toblock 306 from blocks 308 and 310 when the “No” branches are followed.

Therefore, FIG. 4 illustrates certain embodiments in which by using atimer 120 and a destage counter 122, the augmented intelligent writecaching application 114 improves the response time to reads, byperiodically moving the head for destaging from the inside and/oroutside diameter of disks while traversing a sorted binary tree 116 ofspatially ordered tracks. The increase is read response time is at leastadequate to satisfy the set of read requirements criteria 124. If theread response time is not adequate to satisfy the set of readrequirements criteria 124, then the timer 120 may be set to a lowerpredetermined value and the destages from the inside and outsidediameters may be performed at smaller time intervals. In certainembodiments, workload simulations may be performed to determine whatpredetermined value of the timer 120 is adequate to satisfy the readresponse times provided by the read requirements criteria 124.

It should be noted, that in certain embodiments the first track at thebeginning of the sorted binary tree may correspond to a track at theinside diameter of a disk or some track that is close to the insidediameter of the disk, and the last track at the end of the sorted binarytree may correspond to a track at the outside diameter of the disk orsome track that is close to the outside diameter of the disk. Inalternative embodiments, the first track at the beginning of the sortedbinary tree may correspond to a track at the outside diameter of a diskor some track that is close to the outside diameter of the disk, and thelast track at the end of the sorted binary tree may correspond to atrack at the inside diameter of the disk or some track that is close tothe inside diameter of the disk. In the sorted binary tree the trackspresent within the inside and the outside diameters of the disk areordered spatially. In alternative embodiments, other data structuresbesides the sorted binary tree may represent the ordering of tracks.

FIG. 4 illustrates a flowchart 400 that shows second operations forperforming periodic destages from inside and/or outside diameters ofdisks while traversing a data structure that stores tracks in a sortedspatial order, in accordance with certain embodiments. The operationsshown in FIG. 4 may be performed by the augmented intelligent writecaching application 114 implemented in the storage controller 102.

Control starts at block 402 in which a storage controller 102 thatincludes a cache 108, receives a command from a host 104 a, wherein aset of criteria 124 corresponding to read response times for executingthe command have to be satisfied, A destage application 114 thatdestages tracks based at least on recency of usage and spatial locationof the tracks is executed (at block 404), wherein a spatial ordering ofthe tracks is maintained in a data structure 116, and the destageapplication 114 traverses the spatial ordering of the tracks. In certainembodiments, the destage application 114 is an augmented intelligentwrite caching application.

Control proceeds to block 406 in which tracks are destaged from at leastinside and/or outside diameters of disks at periodic intervals, whiletraversing the spatial ordering of the tracks, wherein the set ofcriteria 124 corresponding to the read response times for executing thecommand are satisfied. In certain embodiments, by destaging tracks fromthe inside and/or outside diameters of disks at the periodic intervals,read tracks that are relatively distant from a current location of ahead are serviced by overriding the spatial ordering.

Therefore, FIGS. 1-4 illustrate certain embodiments in which anaugmented intelligent write caching application 114 augments anintelligent write caching application that is a hybrid of CLOCK andCSCAN destage mechanism. The augmented intelligent write cachingapplication periodically destages tracks from inside and/or outsidediameters of disks while traversing a spatially sorted list of tracksfor destages, by overriding the current track to be destaged from thespatially sorted list. As a result reads can be performed with a fasterresponse time in comparison to situations where periodic destages atpredetermined time intervals are not performed from inside and/oroutside diameter of disks.

Additional Embodiment Details

The described operations may be implemented as a method, apparatus orcomputer program product using standard programming and/or engineeringtechniques to produce software, firmware, hardware, or any combinationthereof. Accordingly, aspects of the embodiments may take the form of anentirely hardware embodiment, an entirely software embodiment (includingfirmware, resident software, micro-code, etc.) or an embodimentcombining software and hardware aspects that may all generally bereferred to herein as a “circuit,” “module” or “system.” Furthermore,aspects of the embodiments may take the form of a computer programproduct embodied in one or more computer readable medium(s) havingcomputer readable program code embodied there.

Any combination of one or more computer readable medium(s) may beutilized. The computer readable medium may be a computer readable signalmedium or a computer readable storage medium. A computer readablestorage medium may be, for example, but not limited to, an electronic,magnetic, optical, electromagnetic, infrared, or semiconductor system,apparatus, or device, or any suitable combination of the foregoing. Morespecific examples (a non-exhaustive list) of the computer readablestorage medium would include the following: an electrical connectionhaving one or more wires, a portable computer diskette, a hard disk, arandom access memory (RAM), a read-only memory (ROM), an erasableprogrammable read-only memory (EPROM or Flash memory), an optical fiber,a portable compact disc read-only memory (CD-ROM), an optical storagedevice, a magnetic storage device, or any suitable combination of theforegoing. In the context of this document, a computer readable storagemedium may be any tangible medium that can contain, or store a programfor use by or in connection with an instruction execution system,apparatus, or device.

A computer readable signal medium may include a propagated data signalwith computer readable program code embodied therein, for example, inbaseband or as part of a carrier wave. Such a propagated signal may takeany of a variety of forms, including, but not limited to,electro-magnetic, optical, or any suitable combination thereof. Acomputer readable signal medium may be any computer readable medium thatis not a computer readable storage medium and that can communicate,propagate, or transport a program for use by or in connection with aninstruction execution system, apparatus, or device.

Program code embodied on a computer readable medium may be transmittedusing any appropriate medium, including but not limited to wireless,wireline, optical fiber cable, RF, etc., or any suitable combination ofthe foregoing.

Computer program code for carrying out operations for aspects of thepresent invention may be written in any combination of one or moreprogramming languages, including an object oriented programming languagesuch as Java*, Smalltalk, C++ or the like and conventional proceduralprogramming languages, such as the “C” programming language or similarprogramming languages. The program code may execute entirely on theuser's computer, partly on the user's computer, as a stand-alonesoftware package, partly on the user's computer and partly on a remotecomputer or entirely on the remote computer or server. In the latterscenario, the remote computer may be connected to the user's computerthrough any type of network, including a local area network (LAN) or awide area network (WAN), or the connection may be made to an externalcomputer (for example, through the Internet using an Internet ServiceProvider).

Aspects of the present invention are described below with reference toflowchart illustrations and/or block diagrams of methods, apparatus(systems) and computer program products according to embodiments of theinvention. It will be understood that each block of the flowchartillustrations and/or block diagrams, and combinations of blocks in theflowchart illustrations and/or block diagrams, can be implemented bycomputer program instructions. These computer program instructions maybe provided to a processor of a general purpose computer, specialpurpose computer, or other programmable data processing apparatus toproduce a machine, such that the instructions, which execute via theprocessor of the computer or other programmable data processingapparatus, create means for implementing the functions/acts specified inthe flowchart and/or block diagram block or blocks.

These computer program instructions may also be stored in a computerreadable medium that can direct a computer, other programmable dataprocessing apparatus, or other devices to function in a particularmanner, such that the instructions stored in the computer readablemedium produce an article of manufacture including instructions whichimplement the function/act specified in the flowchart and/or blockdiagram block or blocks.

The computer program instructions may also be loaded onto a computer,other programmable data processing apparatus, or other devices to causea series of operational steps to be performed on the computer, otherprogrammable apparatus or other devices to produce a computerimplemented process such that the instructions which execute on thecomputer or other programmable apparatus provide processes forimplementing the functions/acts specified in the flowchart and/or blockdiagram block or blocks.

FIG. 5 illustrates a block diagram that shows certain elements that maybe included in the storage controller 102 or the hosts 104 a . . . 104n, in accordance with certain embodiments. The system 500 may comprisethe storage controller 102 or the hosts 104 a . . . 104 n, and mayinclude a circuitry 502 that may in certain embodiments include at leasta processor 504. The system 500 may also include a memory 506 (e.g., avolatile memory device), and storage 508. The storage 508 may include anon-volatile memory device (e.g., EEPROM, ROM, PROM, RAM, DRAM, SRAM,flash, firmware, programmable logic, etc.), magnetic disk drive, opticaldisk drive, tape drive, etc. The storage 508 may comprise an internalstorage device, an attached storage device and/or a network accessiblestorage device. The system 500 may include a program logic 510 includingcode 512 that may be loaded into the memory 506 and executed by theprocessor 504 or circuitry 502. In certain embodiments, the programlogic 510 including code 512 may be stored in the storage 508. Incertain other embodiments, the program logic 510 may be implemented inthe circuitry 502. Therefore, while FIG. 5 shows the program logic 510separately from the other elements, the program logic 510 may beimplemented in the memory 506 and/or the circuitry 502.

Certain embodiments may be directed to a method for deploying computinginstruction by a person or automated processing integratingcomputer-readable code into a computing system, wherein the code incombination with the computing system is enabled to perform theoperations of the described embodiments.

The terms “an embodiment”, “embodiment”, “embodiments”, “theembodiment”, “the embodiments”, “one or more embodiments”, “someembodiments”, and “one embodiment” mean “one or more (but not all)embodiments of the present invention(s)” unless expressly specifiedotherwise.

The terms “including”, “comprising”, “having” and variations thereofmean “including but not limited to”, unless expressly specifiedotherwise.

The enumerated listing of items does not imply that any or all of theitems are mutually exclusive, unless expressly specified otherwise.

The terms “a”, “an” and “the” mean “one or more”, unless expresslyspecified otherwise.

Devices that are in communication with each other need not be incontinuous communication with each other, unless expressly specifiedotherwise. In addition, devices that are in communication with eachother may communicate directly or indirectly through one or moreintermediaries.

A description of an embodiment with several components in communicationwith each other does not imply that all such components are required. Onthe contrary a variety of optional components are described toillustrate the wide variety of possible embodiments of the presentinvention.

Further, although process steps, method steps, algorithms or the likemay be described in a sequential order, such processes, methods andalgorithms may be configured to work in alternate orders. In otherwords, any sequence or order of steps that may be described does notnecessarily indicate a requirement that the steps be performed in thatorder. The steps of processes described herein may be performed in anyorder practical. Further, some steps may be performed simultaneously.

When a single device or article is described herein, it will be readilyapparent that more than one device/article (whether or not theycooperate) may be used in place of a single device/article. Similarly,where more than one device or article is described herein (whether ornot they cooperate), it will be readily apparent that a singledevice/article may be used in place of the more than one device orarticle or a different number of devices/articles may be used instead ofthe shown number of devices or programs. The functionality and/or thefeatures of a device may be alternatively embodied by one or more otherdevices which are not explicitly described as having suchfunctionality/features. Thus, other embodiments of the present inventionneed not include the device itself.

At least certain operations that may have been illustrated in thefigures show certain events occurring in a certain order. In alternativeembodiments, certain operations may be performed in a different order,modified or removed. Moreover, steps may be added to the above describedlogic and still conform to the described embodiments. Further,operations described herein may occur sequentially or certain operationsmay be processed in parallel. Yet further, operations may be performedby a single processing unit or by distributed processing units.

The foregoing description of various embodiments of the invention hasbeen presented for the purposes of illustration and description. It isnot intended to be exhaustive or to limit the invention to the preciseform disclosed. Many modifications and variations are possible in lightof the above teaching. It is intended that the scope of the invention belimited not by this detailed description, but rather by the claimsappended hereto. The above specification, examples and data provide acomplete description of the manufacture and use of the composition ofthe invention. Since many embodiments of the invention can be madewithout departing from the spirit and scope of the invention, theinvention resides in the claims hereinafter appended.

* Java is a trademark or registered trademark of Oracle and/or itsaffiliates.

What is claimed is:
 1. A system, comprising: a memory; and a processorcoupled to the memory, wherein the processor performs operations, theoperations comprising: receiving a command from a host, wherein a set ofcriteria corresponding to read response times for executing the commandhave to be satisfied; executing a destage application that destagestracks based at least on recency of usage and spatial location of thetracks, wherein a spatial ordering of the tracks is maintained in a datastructure, and the destage application traverses the spatial ordering ofthe tracks; and destaging tracks from at least inside or outsidediameters of disks at periodic intervals, while traversing the spatialordering of the tracks, wherein the set of criteria corresponding to theread response times for executing the command are satisfied, wherein theoperations further comprise: setting a timer to a predetermined timeinterval and setting a destage counter to zero; and picking up a trackat a cursor position to destage while traversing the data structure thatmaintains the spatial ordering of the tracks.
 2. The system of claim 1,wherein by destaging tracks from the inside and outside diameters ofdisks at the periodic intervals, read tracks that are relatively distantfrom a current location of a head are serviced by overriding the spatialordering.
 3. The system of claim 1, wherein the periodic interval is afixed predetermined period of time, wherein the fixed predeterminedperiod of time is determined by simulating a workload that correspondsto at least read requests arriving from a stringent read requirementsapplication.
 4. The system of claim 1, the operations furthercomprising: in response to determining that the timer has expired, andin response to determining that the destage counter is zero, performing:finding the first track at the beginning of the data structure; anddestaging the first track instead of a track at the cursor position,without changing the cursor position.
 5. The system of claim 1, whereinthe data structure is a sorted binary tree of tracks, the operationsfurther comprising: in response to determining that the timer hasexpired, and in response to determining that the destage counter iszero, performing: finding the first track at the beginning of the sortedbinary tree; destaging the first track instead of a track at the cursorposition, without changing the cursor position; incrementing the destagecounter to one; and continuing to pick up tracks to perform destagesfrom the cursor position.
 6. The system of claim 5, the operationsfurther comprising: in response to determining that the timer hasexpired, and in response to determining that the destage counter is notzero, performing: finding the last track at the end of the sorted binarytree; destaging the last track instead of a track at the cursorposition, without changing the cursor position; setting the destagecounter to zero; setting the timer to the predetermined time interval;and continuing to pick up tracks to perform destages from the cursorposition.
 7. A computer program product, the computer program productcomprising: a non-transitory computer readable storage medium havingcomputer readable program code embodied therewith, the computer readableprogram code configured to perform operations, the operationscomprising: receiving, by a storage controller that includes a cache, acommand from a host, wherein a set of criteria corresponding to readresponse times for executing the command have to be satisfied; executinga destage application that destages tracks based at least on recency ofusage and spatial location of the tracks, wherein a spatial ordering ofthe tracks is maintained in a data structure, and the destageapplication traverses the spatial ordering of the tracks; and destagingtracks from at least inside or outside diameters of disks at periodicintervals, while traversing the spatial ordering of the tracks, whereinthe set of criteria corresponding to the read response times forexecuting the command are satisfied, wherein the operations furthercomprise: setting a timer to a predetermined time interval and setting adestage counter to zero; and picking up a track at a cursor position todestage while traversing the data structure that maintains the spatialordering of the tracks.
 8. The computer program product of claim 7,wherein by destaging tracks from the inside and outside diameters ofdisks at the periodic intervals, read tracks that are relatively distantfrom a current location of a head are serviced by overriding the spatialordering.
 9. The computer program product of claim 7, wherein theperiodic interval is a fixed predetermined period of time, wherein thefixed predetermined period of time is determined by simulating aworkload that corresponds to at least read requests arriving at thestorage controller from a stringent read requirements application. 10.The computer program product of claim 7, the operations furthercomprising: in response to determining that the timer has expired, andin response to determining that the destage counter is zero, performing:finding the first track at the beginning of the data structure; anddestaging the first track instead of a track at the cursor position,without changing the cursor position.
 11. The computer program productof claim 7, wherein the data structure is a sorted binary tree oftracks, the operations further comprising: in response to determiningthat the timer has expired, and in response to determining that thedestage counter is zero, performing: finding the first track at thebeginning of the sorted binary tree; destaging the first track insteadof a track at the cursor position, without changing the cursor position;incrementing the destage counter to one; and continuing to pick uptracks to perform destages from the cursor position.
 12. The computerprogram product of claim 11, the operations further comprising: inresponse to determining that the timer has expired, and in response todetermining that the destage counter is not zero, performing: findingthe last track at the end of the sorted binary tree; destaging the lasttrack instead of a track at the cursor position, without changing thecursor position; setting the destage counter to zero; setting the timerto the predetermined time interval; and continuing to pick up tracks toperform destages from the cursor position.
 13. A storage controller incommunication with a host and a plurality of volumes, the storagecontroller comprising: a processor; and a cache coupled to theprocessor, wherein the storage controller performs: receiving a commandfrom the host, wherein a set of criteria corresponding to read responsetimes for executing the command have to be satisfied; executing adestage application that destages tracks based at least on recency ofusage and spatial location of the tracks, wherein a spatial ordering ofthe tracks is maintained in a data structure, and the destageapplication traverses the spatial ordering of the tracks; and destagingtracks from at least inside or outside diameters of disks at periodicintervals, while traversing the spatial ordering of the tracks, whereinthe set of criteria corresponding to the read response times forexecuting the command are satisfied, wherein the storage controllerfurther performs: setting a timer to a predetermined time interval andsetting a destage counter to zero; and picking up a track at a cursorposition to destage while traversing the data structure that maintainsthe spatial ordering of the tracks.
 14. The storage controller of claim13, wherein by destaging tracks from the inside and outside diameters ofdisks at the periodic intervals, read tracks that are relatively distantfrom a current location of a head are serviced by overriding the spatialordering.
 15. The storage controller of claim 13, the operations furthercomprising: in response to determining that the timer has expired, andin response to determining that the destage counter is zero, performing:finding the first track at the beginning of the data structure; anddestaging the first track instead of a track at the cursor position,without changing the cursor position.
 16. The storage controller ofclaim 13, wherein the periodic interval is a fixed predetermined periodof time, wherein the fixed predetermined period of time is determined bysimulating a workload that corresponds to at least read requestsarriving from a stringent read requirements application.
 17. The storagecontroller of claim 13, wherein the data structure is a sorted binarytree of tracks, wherein the storage controller further performs: inresponse to determining that the timer has expired, and in response todetermining that the destage counter is zero, performing: finding thefirst track at the beginning of the sorted binary tree; destaging thefirst track instead of a track at the cursor position, without changingthe cursor position; incrementing the destage counter to one; andcontinuing to pick up tracks to perform destages from the cursorposition.
 18. The storage controller of claim 17, wherein the storagecontroller further performs: in response to determining that the timerhas expired, and in response to determining that the destage counter isnot zero, performing: finding the last track at the end of the sortedbinary tree; destaging the last track instead of a track at the cursorposition, without changing the cursor position; setting the destagecounter to zero; setting the timer to the predetermined time interval;and continuing to pick up tracks to perform destages from the cursorposition.